Domain of a function

In mathematics, the domain of definition or simply the domain of a function is the set of "input" or argument values for which the function is defined. That is, the function provides an "output" or value for each member of the domain.^[1]

For instance, the domain of cosine is the set of all real numbers, while the domain of the square root consists only of numbers greater than or equal to 0 (ignoring complex numbers in both cases). For a function whose domain is a subset of the real numbers, when the function is represented in an xy Cartesian coordinate system, the domain is represented on the x-axis.

Contents 1 Formal definition 2 Natural domain 3 Domain of a partial function 4 Category theory 5 Real and complex analysis 6 More examples 7 See also 8 References

Formal definition

Given a function f:X→Y, the set X is the domain of f; the set Y is the codomain of f. In the expression f(x), x is the argument and f(x) is the value. One can think of an argument as an input to the function, and the value as the output.

The image (sometimes called the range) of f is the set of all values assumed by f for all possible x; this is the set . The image of f can be the same set as the codomain or it can be a proper subset of it. It is in general smaller than the codomain; it is the whole codomain if and only if f is a surjective function.

A well-defined function must carry every element of its domain to an element of its codomain. For example, the function f defined by

f(x) = 1/x

has no value for f(0). Thus, the set of all real numbers, , cannot be its domain. In cases like this, the function is either defined on or the "gap is plugged" by explicitly defining f(0). If we extend the definition of f to

f(x) = 1/x, for x ≠ 0,

f(0) = 0,

then f is defined for all real numbers, and its domain is .

Any function can be restricted to a subset of its domain. The restriction of g : A → B to S, where S ⊆ A, is written g |_S : S → B.

Natural domain

The natural domain of a formula is the set of values for which it is defined, typically within the reals but sometimes among the integers or complex numbers. For instance the natural domain of square root is the non-negative reals when considered as a real number function. When considering a natural domain the set of possible values of the function is typically called its range.^[2]

Domain of a partial function

There are two distinct meanings in current mathematical usage for the notion of the domain of a partial function from X to Y, i.e. a function from a subset X' of X to Y. Most mathematicians, including recursion theorists, use the term "domain of f" for the set X' of all values x such that f(x) is defined. But some, particularly category theorists, consider the domain to be X, irrespective of whether f(x) exists for every x in X.

Category theory

In category theory one deals with morphisms instead of functions. Morphisms are arrows from one object to another. The domain of any morphism is the object from which an arrow starts. In this context, many set theoretic ideas about domains must be abandoned or at least formulated more abstractly. For example, the notion of restricting a morphism to a subset of its domain must be modified. See subobject for more.

Real and complex analysis

In real and complex analysis, a domain is an open connected subset of a real or complex vector space.

In partial differential equations, a domain is an open connected subset of the euclidean space Rⁿ, where the problem is posed, i.e., where the unknown function(s) are defined.

More examples

• Function is defined for all .
• Function , where is the set of all complex numbers, is defined for all x.
• Function is defined for all

See also

• Range (mathematics)
• Codomain
• Surjective function
• Injective function
• Bijection
• Domain decomposition
• Lipschitz domain
• Effective domain

References

1. ^ Paley, H. Abstract Algebra, Holt, Rinehart and Winston, 1966 (p. 16).
2. ^ Rosenbaum, Robert A.; Johnson, G. Philip (1984). Calculus: basic concepts and applications. Cambridge University Pressd. p. 60. ISBN 0521250129. 

Logic   Overview Academic areas Argumentation theory Axiology Critical thinking Computability theory Formal semantics History of logic Informal logic Logic in computer science Mathematical logic Mathematics Metalogic Metamathematics Model theory Philosophical logic Philosophy Philosophy of logic Philosophy of mathematics Proof theory Set theory Foundational concepts Abduction Analytic truth Antinomy A priori Deduction Definition Description Entailment Induction Inference Logical consequence Logical form Logical implication Logical truth Name Necessity Meaning Paradox Possible world Presupposition Probability Reason Reasoning Reference Semantics Statement Strict implication Substitution Syntax Truth Truth value Validity   Philosophical logic Critical thinking and Informal logic Analysis Ambiguity Argument Belief Bias Credibility Evidence Explanation Explanatory power Fact Fallacy Inquiry Opinion Parsimony Premise Propaganda Prudence Reasoning Relevance Rhetoric Rigor Vagueness Theories of deduction Constructivism Dialetheism Fictionalism Finitism Formalism Intuitionism Logical atomism Logicism Nominalism Platonic realism Pragmatism Realism   Metalogic and metamathematics Cantor's theorem Church's theorem Church's thesis Consistency Effective method Foundations of mathematics Gödel's completeness theorem Gödel's incompleteness theorems Soundness Completeness Decidability Interpretation Löwenheim–Skolem theorem Metatheorem Satisfiability Independence Type–token distinction Use–mention distinction   Mathematical logic General Formal language Formation rule Formal system Deductive system Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Natural deduction Rule of inference Relation Theorem Logical consequence Axiomatic system Type theory Symbol Syntax Theory Traditional logic Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram Propositional calculus and Boolean logic Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Predicate First-order Quantifiers Predicate Second-order Monadic predicate calculus Set theory Set Empty set Enumeration Extensionality Finite set Function Subset Power set Countable set Recursive set Domain Range Ordered pair Uncountable set Model theory Model Interpretation Non-standard model Finite model theory Truth value Validity Proof theory Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax Computability theory Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function   Non-classical logic Modal logic Alethic Axiologic Deontic Doxastic Epistemic Temporal Intuitionism Intuitionistic logic Constructive analysis Heyting arithmetic Intuitionistic type theory Constructive set theory Fuzzy logic Degree of truth Fuzzy rule Fuzzy set Fuzzy finite element Fuzzy set operations Substructural logic Structural rule Relevance logic Linear logic Paraconsistent logic Dialetheism Description logic Ontology Ontology language   Logicians Anderson Aristotle Averroes Avicenna Bain Barwise Bernays Boole Boolos Cantor Carnap Church Chrysippus Curry De Morgan Frege Geach Gentzen Gödel Hilbert Kleene Kripke Leibniz Löwenheim Peano Peirce Putnam Quine Russell Schröder Scotus Skolem Smullyan Tarski Turing Whitehead William of Ockham Wittgenstein Zermelo   Lists Topics Outline of logic Index of logic articles Mathematical logic Boolean algebra Set theory Other Logicians Rules of inference Paradoxes Fallacies Logic symbols Portal Category Outline WikiProject Talk changes